Beam: A Tool for Complex Update Operations on File Trees

نویسنده

  • Thomas Eirich
چکیده

Beam is a program that synthesizes file trees from one or more source file trees. An instruction file contains the synthesis rules. The simplest form of a synthesis is making the destination tree an exact copy of a single source tree. If the destination tree already exists, it is verified for consistency with the sources and the synthesis rules. Updates occur when inconsistencies are detected. We present a concept for automated updates of heterogeneous workstation clusters using beam’s powerful synthesis facilities. A decomposition of a UNIX installation into separately maintainable file trees is proposed. Beam then recomposes these file trees to synthesize individual UNIX installations for each workstation. Another decomposition concept of beam are packs. A file tree can be grouped into packs of files. Usually, files of one pack are related to some common functionality of the software. Customizing a software package to individual needs is reduced to the selection of an appropriate set of packs. Thus, files not needed or seldomly used are not copied to the local disk. Instead, a symbolic link to the corresponding file on the server is created. The software package is complete without wasting too much space. The limited disk space of workstations is optimally used. The automated update concept of beam allows central maintenance and control of the updates without preventing arbitrary n–to–m relationships between servers and workstations. This centralism has the disadvantage that updates do not take place if the beam server is down. But this deficiency can be turned into a more graceful degradation if the beam installation itself is propagated and updated by each workstation. What software is updated, in which configuration and when updates occur can be controlled individually per workstation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CTL Model Update for System Modifications

Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update towards the development of an automatic system modification tool that extends model checking functions. We define primitive update operations on the models of Computation Tree Logic (CTL) and formalize the principle of m...

متن کامل

An Interactive Solid Modeling Tool

Sculpt, an interactive polyhedral solid modeling system, combines the effectiveness of BSP trees for performing geometric search, set operations, and determination of visibility, with the rendering performance of the AT&T Pixel Machines to provide interactive SCUlpting of texture mapped solids. The paradigm presented to the user is one in which a tool is used to modify a workpiece repeatedly by...

متن کامل

An Update of Couch Effect on the Attenuation of Megavoltage Radiotherapy Beam and the Variation of Absorbed Dose in the Build-up Region

Purpose: Fiber carbon is the most common material used in treating couch as it causes less beam attenuation than other materials. Beam attenuation replaces build-up region, reduces skin-sparing effect and causes target volume under dosage. In this study, we aimed to evaluate beam attenuation and variation of build-up region in 550 TxT radiotherapy couch.Materials and Methods: In this study, we ...

متن کامل

Evaluating Expression Trees in Hardware

We propose expression trees as an universal format for communication and as an executable specification for work-items. The presented application-specific instruction-set processor (ASIP) interprets a stream of expressions received from the main processor to speed-up expensive floating-point operations. Due to our term rewriting approach, long pipelines, as they are required for floating-point ...

متن کامل

DeltaTree: A Practical Locality-aware Concurrent Search Tree

As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality. However, existing highly-concurrent search trees such as red-black trees and AVL trees do not consider data locality while existing locality-aware search trees such as those based on the van Emde Boas layout (vEB-based trees), poorly support ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994